
// 300.最长递增子序列
class Solution {
public:
    int lengthOfLIS(vector<int>& nums) {
        // 采用动态规划来进行解决
        int n = nums.size();
        vector<int> dp(n,1);
        int ret = 1;
        for(int i = 1; i < n ;i++)
        {
            for(int j = 0 ; j < i ;j++)
                if(nums[j] < nums[i])
                    dp[i] = max(dp[j] + 1 ,dp[i]);
            ret = max(ret,dp[i]);
        }
        return ret;
    }
};